On the complexsity of some substructural logics
نویسنده
چکیده
We use a syntactic interpretation of MALL in BCI with ∧, defined in [5], to prove the undecidability of the consequence relations for BCI with ∧ and BCI with ∨, and the NP-completeness of BCI. Similar results are obtained for a variant of the Lambek calculus.
منابع مشابه
Substructural Logics and Residuated Lattices — an Introduction
This is an introductory survey of substructural logics and of residuated lattices which are algebraic structures for substructural logics. Our survey starts from sequent systems for basic substructural logics and develops the proof theory of them. Then, residuated lattices are introduced as algebraic structures for substructural logics, and some recent developments of their algebraic study are ...
متن کاملFuzzy Logics and Sub-structural Logics without Exchange
This report treats the relation between substructural logics and fuzzy logics, especially focuses on the noncommutativity of conjunctive operators i.e. substructural logics without the exchange rule. As the results, the authors show that fuzzy logics based on the left continuous pseudo-t-norms are the extensions of FLw. Also, we introduce the definition of pseudouninorms and give some methods t...
متن کاملModal translations in substructural logics
Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic, It is proved that first-order variants of these logics with an intuitionistic negation cm be embedded by modal translations into M-type extensions of these logics with...
متن کاملA Canonical Model Construction for Substructural Logics
In this paper, we introduce a class of substructural logics, called normal substructural logics, which includes not only relevant logic, BCK logic, linear logic and the Lambek calculus but also weak logics with strict implication, and de ne Kripkestyle semantics (Kripke frames and models) for normal substructural logics. Then we show a correspondence between axioms and properties on frames, and...
متن کاملDisplaying and Deciding Substructural Logics 1: Logics with Contraposition
Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic (Belnap 1982). However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modi ed proof theory which more closely models relevant logics. In addition, we use this proof theory to provide decidability proofs for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reports on Mathematical Logic
دوره 43 شماره
صفحات -
تاریخ انتشار 2008